An outer approximation method for the road network design problem
نویسندگان
چکیده
منابع مشابه
An outer approximation method for the road network design problem
Best investment in the road infrastructure or the network design is perceived as a fundamental and benchmark problem in transportation. Given a set of candidate road projects with associated costs, finding the best subset with respect to a limited budget is known as a bilevel Discrete Network Design Problem (DNDP) of NP-hard computationally complexity. We engage with the complexity with a hybri...
متن کاملAn Outer Approximation Method for the Variational Inequality Problem
We study two outer approximation schemes, applied to the variational inequality problem in reflexive Banach spaces. First we pro∗Research of this author was supported by CAPES Grant BEX 0664-02/2. †Partially supported by PICDT/UFPI-CAPES ‡Partially supported by CNPq Grant 301200/93-9(RN) and by PRONEX– Optimization.
متن کاملAn Approximation Method for Fuzzy Fixed-Charge Transportation Problem
In this paper, we develop the fuzzy fixed charge transportation problem when the costs are the fuzzy numbers. The first step it transform into the classical fuzzy transportation problem. The next, we obtain the best approximation fuzzy on the optimal value of the fuzzy fixed-charge transportation problem. This method obtains a lower and upper bounds both on the fuzzy optimal value of the fuzzy ...
متن کاملAn efficient approximation algorithm for the survivable network design problem
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-t ime approximation algorithm was given by Williamson et al. (Combinatorica 15 (1995) 435454) . This paper gives an improved version that is more efficient. Consider a graph of n vertices and connectivity requirements that are at most...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLOS ONE
سال: 2018
ISSN: 1932-6203
DOI: 10.1371/journal.pone.0192454